Some Heuristics about Elliptic Curves

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Heuristics on pairing-friendly elliptic curves

We present a heuristic asymptotic formula as x → ∞ for the number of isogeny classes of pairing-friendly elliptic curves over prime fields with fixed embedding degree k ≥ 3, with fixed discriminant, with rho-value bounded by a fixed ρ0 such that 1 < ρ0 < 2, and with prime subgroup order at most x.

متن کامل

Heuristics for the Arithmetic of Elliptic Curves

This is an introduction to a probabilistic model for the arithmetic of elliptic curves, a model developed in a series of articles of the author with Bhargava, Kane, Lenstra, Park, Rains, Voight, and Wood. We discuss the theoretical evidence for the model, and we make predictions about elliptic curves based on corresponding theorems proved about the model. In particular, the model suggests that ...

متن کامل

Primality proofs with elliptic curves: heuristics and analysis

This paper deals with the heuristic running time analysis of the elliptic curve primality proving (ECPP) algorithm of Atkin and Morain. Our aim is to collect assumptions and the fastest possible algorithms to reduce the heuristic running time and to show that under these assumptions and some plausible conditions the heuristic running time can be reduced down to o(ln n) bit operation for input p...

متن کامل

On some congruence properties of elliptic curves

In this paper, as a result of a theorem of Serre on congruence properties, a complete solution is given for an open question (see the text) presented recently by Kim, Koo and Park. Some further questions and results on similar types of congruence properties of elliptic curves are also presented and discussed.

متن کامل

Some integer factorization algorithms using elliptic curves

Lenstra’s integer factorization algorithm is asymptotically one of the fastest known algorithms, and is ideally suited for parallel computation. We suggest a way in which the algorithm can be speeded up by the addition of a second phase. Under some plausible assumptions, the speedup is of order ln(p), where p is the factor which is found. In practice the speedup is significant. We mention some ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Experimental Mathematics

سال: 2008

ISSN: 1058-6458,1944-950X

DOI: 10.1080/10586458.2008.10129019